A Multi-beam Model of Antenna Array Pat- Tern Synthesis Based on Conic Trust Region Method

In this paper, we propose a multi-beam model for antenna array pattern synthesis (AAPS) problem. The model uses a conic trust region algorithm (CTRA) similarly proposed in this paper to optimize its cost function. Undoubtedly, whole algorithm efficiency ultimately lies on the CTRA, thereof, we propose a method to improve the iterative algorithm’s efficiency. Unlike traditional trust region methods that resolve sub-problems, the CTRA efficiently searches a region via solving a inequation, by which it identifies new iteration points when a trial step is rejected. Thus, the proposed algorithm improves computational efficiency. Moreover, the CTRA has strong convergence properties with the local superlinear and quadratic convergence rate under mild conditions, and exhibits high efficiency and robustness. Finally, we apply the combinative algorithm to AAPS. Numerical results show that the method is highly robust, and computer simulations indicate that the algorithm excellently performs AAPS problem.